TRAPS - A Time Dependent Resource Allocation Language

نویسندگان

  • G. Trzewik
  • Ehud Gudes
  • Amnon Meisels
  • Gadi Solotorevsky
چکیده

A general language for specifying resource allocation in Scheduling problems is presented. TRAPS is a superclass of the RAPS (Resource Allocation Problem Specication) language developed by the authors [31]. TRAPS enables the speci cation of a scheduling problem by adding built in time operators, on top of existing terms for resources, activities, allocation rules and constraints. In this way TRAPS provides a convenient knowledge acquisition tool. The language syntax is powerful and allows the speci cation of rules and constraints which are di cult to formulate with traditional approaches, and it also supports the speci cation of various control and backtracking strategies. The generalized inference engine that runs compiled TRAPS programs is enhanced to provide all needed operations for a typical PERT/CPM calculations on a schedule. This engine acts as an expert system shell and is called ESRA (Expert System for Resource Allocation). The performance of TRAPS combined with ESRA is demonstrated by analyzing its solution of a typical scheduling problem, that of a software management project. The analysis shows that certain heuristics which formed the basis of our strategy for resource allocation (cf. [31]) perform very well also in the (time dependent) scheduling domain. keywords: expert systems, scheduling, resource allocation, Prolog, knowledge acquisition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cycle Time Reduction and Runtime Rebalancing by Reallocating Dependent Tasks

Business Process Management Systems (BPMS) is a complex information system that provides designing, administrating, and improving the business processes. Task allocation to human resources is one of the most important issues which should be managed more efficiently in BPMS. Task allocation algorithms are defined in order to meet the various policies of organizations. The most important of these...

متن کامل

Resource Allocation through Context-dependent data envelopment analysis

System designs, optimizing resource allocation to organization units, is still being considered as a complicated problem especially when there are multiple inputs and outputs related to a unit. The algorithm presented here will divide the frontiers obtained with DEA. In this way, we investigate a new approach for resource allocation.

متن کامل

Cycle Time Optimization of Processes Using an Entropy-Based Learning for Task Allocation

Cycle time optimization could be one of the great challenges in business process management. Although there is much research on this subject, task similarities have been paid little attention. In this paper, a new approach is proposed to optimize cycle time by minimizing entropy of work lists in resource allocation while keeping workloads balanced. The idea of the entropy of work lists comes fr...

متن کامل

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

متن کامل

An Algorithm for Resource Allocation through the Classification of DMUs

  Data envelopment analysis (DEA) is a non-parametric method for assessing relative efficiency of decision-making units (DMUs). Every single decision-maker with the use of inputs produces outputs. These decision-making units will be defined by the production possibility set. Resource allocation to DMUs is one of the concerns of managers since managers can employ the results of this process to a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995